Collection of Combinational Arithmetic Miters

نویسنده

  • Armin Biere
چکیده

In this short note we present a collection of benchmarks submitted to the SAT Competition 2016. Most of them stem from other sources, some crafted ones are new, but all present equivalence checking problems (miters) for arithmetic circuits, such as multipliers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of arithmetic datapath designs using word-level approach - A case study

The paper describes an efficient method to prove equivalence between two integer arithmetic datapath designs specified at the register transfer level. The method is illustrated with an industrial ALU design. As reported in literature, solving it using a commercial equivalence checking tool required casesplitting, which limits its applicability to larger designs. We show how such a task can be s...

متن کامل

Function Verification of Combinational Arithmetic Circuits

FUNCTION VERIFICATION OF COMBINATIONAL ARITHMETIC CIRCUIT MAY 2015 DUO LIU B.S., JIANGNAN UNIVERSITY, WUXI, JIANGSU, CHINA M.S.E.C.E., UNIVERSITY OF MASSACHUSETTS AMHERST Directed by: Professor Maciej Ciesielski Hardware design verification is the most challenging part in overall hardware design process. It is because design size and complexity are growing very fast while the requirement for pe...

متن کامل

Combinational arithmetic systems for the approximation

The concepts of arithmetic building blocks (ABB) and combinational arithmetic (CA) nets as well as their applications have been previously reported in References 3, 4, and 5. The unique ABB, resulting from the efforts of minimizing the set of building blocks in Reference 3, is designed at the arithmetic level, employing the redundant signed-digit number system,2 and is to be implemented as one ...

متن کامل

Combinational Logic Circuit Design with the Buchberger Algorithm

We detail a procedure for the computation of the polynomial form of an electronic combinational circuit from the design equations in a truth table. The method uses the Buchberger algorithm rather than current traditional methods based on search algorithms. We restrict the analysis to a single output, but the procedure can be generalized to multiple outputs. The procedure is illustrated with the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016